Investigating the recoverable robust single machine scheduling problem under interval uncertainty
نویسندگان
چکیده
We investigate the recoverable robust single machine scheduling problem under interval uncertainty. In this setting, jobs have first-stage processing times p and second-stage q we aim to find a schedule with minimum combined sum of completion times, such that at least Δ share same position in both schedules. provide positive complexity results for some important special cases problem, as well derive 2-approximation algorithm full problem. Computational experiments examine performance an exact mixed-integer programming formulation approximation algorithm, demonstrate strength proposed polynomial time greedy heuristic.
منابع مشابه
Recoverable robust spanning tree problem under interval uncertainty representations
This paper deals with the recoverable robust spanning tree problem under interval uncertainty representations. A strongly polynomial time, combinatorial algorithm for the recoverable spanning tree problem is first constructed. This problem generalizes the incremental spanning tree problem, previously discussed in literature. The algorithm built is then applied to solve the recoverable robust sp...
متن کاملOn the Robust Single Machine Scheduling Problem
The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncertainty of the processing times, a robustness approach is appropriate. In this paper, we show that the robust version of the (SS) problem is NP-complete even for very restricted cases. We present an algorithm for findin...
متن کاملA robust approach for the single machine scheduling problem
This paper describes a robust approach for the single machine scheduling problem 1|ri|Lmax. The method is said robust since it characterizes a large set of optimal solutions allowing to switch from one solution to another, without any performance loss, in order to face the potential disruptions which occur during the schedule execution. It is based on a dominance theorem that characterizes a se...
متن کاملA Single Machine Capacitated Production Planning Problem Under Uncertainty: A Grey Linear Programming Approach
The production planning is an important problem in most of manufacturing systems in practice. Unlike many researches existing in literature, this problem encounters with great uncertainties in parameters and input data. In this paper, a single machine capacitated production planning problem is considered and a linear programming formulation is presented. The production costs are assumed to be u...
متن کاملComplexity of single machine scheduling problems under scenario-based uncertainty
We consider scheduling environments where some job characteristics are uncertain. This uncertainty is modeled through a finite set of well-defined scenarios. In such a context, we search for a solution that is acceptable for any considered scenario. For this purpose, several criteria can be applied to select among solutions. We use here the so-called absolute robustness criterion. We present al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2022
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2022.02.005